On the Kostlan-Shub-Smale model for random polynomial systems. Variance of the number of roots
نویسنده
چکیده
We consider a random polynomial system with m equations and m real unknowns. Assume all equations have the same degree d and the law on the coefficients satisfies the Kostlan-Shub-Smale hypotheses. It is known that E(N) = d where N denotes the number of roots of the system. Under the condition that d does not grow very fast, we prove that lim supm→+∞ V ar( N dm/2 ) ≤ 1. Moreover, if d ≥ 3 then V ar( N X dm/2 )→ 0 as m→ +∞, which implies N X dm/2 → 1 in probability. AMS subject classification: Primary 60G60, 14Q99. Secondary: 30C15. Short Title: Random polynomial systems
منابع مشابه
Asymptotic variance and CLT for the number of zeros of Kostlan Shub Smale random polynomials
Article history: Received 28 April 2015 Accepted after revision 17 September 2015 Available online 29 October 2015 Presented by the Editorial Board In this note, we find the asymptotic main term of the variance of the number of roots of Kostlan–Shub–Smale random polynomials and prove a central limit theorem for this number of roots as the degree goes to infinity. © 2015 Académie des sciences. P...
متن کاملOn the Roots of a Random System of Equations. The Theorem of Shub and Smale and Some Extensions
We give a new proof of a theorem of Shub & Smale [9] on the expectation of the number of roots of a system of m random polynomial equations in m real variables, having a special isotropic Gaussian distribution. Further, we present a certain number of extensions, including the behaviour as m → +∞ of the variance of the number of roots, when the system of equations is also stationary. AMS subject...
متن کاملA Direct Ultrametric Approach to Additive Complexity and the Shub-Smale Tau Conjecture
The Shub-Smale Tau Conjecture is a hypothesis relating the number of integral roots of a polynomial f in one variable and the Straight-Line Program (SLP) complexity of f . A consequence of the truth of this conjecture is that, for the Blum-Shub-Smale model over the complex numbers, P differs from NP. We prove two weak versions of the Tau Conjecture and in so doing show that the Tau Conjecture f...
متن کاملComplexity of Bezout’s Theorem Iv: Probability of Success; Extensions
Michael Shub and Steve Smale Abstra t. We estimate the probability that a given number of projective Newton steps applied to a linear homotopy of a system of n homogeneous polynomial equations in n + 1 complex variables of fixed degrees will find all the roots of the system. We also extend the framework of our analysis to cover the classical implicit function theorem and revisit the condition n...
متن کاملCounting Tropically Degenerate Valuations and p-adic Approaches to the Hardness of the Permanent
The Shub-Smale τ -Conjecture is a hitherto unproven statement (on integer roots of polynomials) whose truth implies both a variant of P 6=NP (for the BSS model overC) and the hardness of the permanent. We give alternative conjectures, some potentially easier to prove, whose truth still implies the hardness of the permanent. Along the way, we discuss new upper bounds on the number of p-adic valu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Complexity
دوره 21 شماره
صفحات -
تاریخ انتشار 2005